Resource allocation scheduling with deteriorating jobs and position-dependent workloads
نویسندگان
چکیده
In this study, we consider the resource allocation scheduling with a deterioration effect and position-dependent workloads concurrently on single machine. The scheduler needs to find optimal sequence such that cost function is minimized. First, focus minimizing linear weighted sum of schedule consumption cost. Second problem minimize subject an upper bound Third Last Pareto-optimal solutions for We proved these problems remain polynomially solvable respectively.
منابع مشابه
Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملScheduling jobs with position-dependent processing times
Bachman and Janiak provided a sketch of the proof that the problem 1|ri,pi(v)1⁄4 ai/v|Cmax is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete proof. Journal of the Operational Research Society (2012) 63, 1018–1020. doi:10.1057/jors...
متن کاملScheduling Resumable Deteriorating Jobs
We consider the following single-machine time-dependent scheduling problem with constraints on the machine availability. There is given a set of independent and deteriorating jobs Jj , 1 ≤ j ≤ n, to be processed on a single machine, starting from time t0 > 0. The processing time pj of job Jj is a proportional function of the starting time Sj of this job, pj = αjSj, where Sj ≥ t0 and deteriorati...
متن کاملScheduling jobs with chain precedence constraints and deteriorating jobs
In this paper we consider a single machine scheduling problem with deteriorating jobs. By deteriorating jobs, we mean that the processing time of a job is a simple linear function of its execution starting time. For the jobs with chain precedence constraints, we prove that the weighted sum of squared completion times minimization problem with strong chains and weak chains can be solved in polyn...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial and Management Optimization
سال: 2023
ISSN: ['1547-5816', '1553-166X']
DOI: https://doi.org/10.3934/jimo.2022011